Computing the minimal distance of cyclic codes
نویسنده
چکیده
We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes.
منابع مشابه
On cyclic codes of composite length and the minimal distance
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and dimension over the same finite field. However, not much is known about these codes. In this paper we explain some of the mysteries of the numerical data by ...
متن کاملBinary Cyclic Codes and Minimal Codewords
Cyclic codes form an important class of codes. They have very interesting algebraic structure. Furthermore, they are equivalent to many important codes, such as binary Hamming codes, Golay codes and BCH codes. Minimal codewords in linear codes are widely used in constructing decoding algorithms and studying linear secret sharing scheme. In this paper, we show that in the binary cyclic code all ...
متن کاملConstruction of cyclic codes over GF ð4Þ for DNA computing
In this paper, we develop the theory for constructing linear and additive cyclic codes of odd length over GF ð4Þ that are suitable for DNA computing. We call this class of codes reversible complement cyclic codes. We use this theory to study all such codes of lengths 7, 9, 11 and 13. We list the codes that have the largest number of codewords for a given minimum Hamming distance. We show that s...
متن کاملSome notes on the characterization of two dimensional skew cyclic codes
A natural generalization of two dimensional cyclic code ($T{TDC}$) is two dimensional skew cyclic code. It is well-known that there is a correspondence between two dimensional skew cyclic codes and left ideals of the quotient ring $R_n:=F[x,y;rho,theta]/_l$. In this paper we characterize the left ideals of the ring $R_n$ with two methods and find the generator matrix for two dimensional s...
متن کاملOn the Minimum Distances of Non-Binary Cyclic Codes
We deal with the minimum distances of q-ary cyclic codes of length qm − 1 generated by products of two distinct minimal polynomials, give a necessary and sufficient condition for the case that the minimum distance is two, show that the minimum distance is at most three if q > 3, and consider also the case q = 3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003